Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers
نویسندگان
چکیده
This paper proposes a uniform framework for the development of parsing and translation algorithms for weighted extended (top-down) tree transducers and input strings. The asymptotic time complexity of these algorithms can be improved in practice by exploiting an algorithm for rule factorization in the above transducers.
منابع مشابه
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of inference algorithms for these automata beyond formal foundations. We give a detailed description of algorithms for application of cascades of weighted tree transducers to weighted tree acceptors, connecting formal the...
متن کاملSurvey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power
Weighted extended top-down tree transducers (transducteurs généralisés descendants [Arnold, Dauchet: Bi-transductions de forêts. ICALP’76. Edinburgh University Press. 1976]) received renewed interest in the field of Natural Language Processing, where they are used in syntax-based machine translation. This survey presents the foundations for a theoretical analysis of weighted extended top-down t...
متن کاملSurvey: Weighted Extended Top-down Tree Transducers Part II - Application in Machine Translation
In this second part of the survey, we present the application of weighted extended topdown tree transducers in machine translation, which is the automatic translation of natural language texts. We present several formal properties that are relevant in machine translation and evaluate the weighted extended top-down tree transducer along those criteria. In addition, we demonstrate how to extract ...
متن کاملEvery sensible extended top-down tree transducer is a multi bottom-up tree transducer
A tree transformation is sensible if the size of each output tree is uniformly bounded by a linear function in the size of the corresponding input tree. Every sensible tree transformation computed by an arbitrary weighted extended top-down tree transducer can also be computed by a weighted multi bottom-up tree transducer. This further motivates weighted multi bottom-up tree transducers as suita...
متن کاملThe Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers
The expressive power of regularity-preserving ε-free weighted linear multi bottom-up tree transducers is investigated. These models have very attractive theoretical and algorithmic properties, but their expressive power is not well understood especially in the weighted setting. It is proved that despite the restriction to preserve regularity their power still exceeds that of composition chains ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010